Graph Embedding-Based Domain-Specific Knowledge Graph Expansion Using Research Literature Summary

نویسندگان

چکیده

Knowledge bases built in the knowledge processing field have a problem that experts to add rules or update them through modifications. To solve this problem, research has been conducted on graph expansion methods using deep learning technology, and recent years, many studies of generating by embedding graph’s triple information continuous vector space. In paper, literature summary, we propose domain-specific method based embedding. end, perform pre-processing process text summarization with collected data. Furthermore, extracting entity relation expanding web summarize Bidirectional Encoder Representations from Transformers for Summarization (BERTSUM) model data design Research-BERT (RE-BERT) extracts entities information, which are components graph, summarized literature. Moreover, proposed related Google news after generated graph. experiment, measured performance summarizing BERTSUM accuracy extraction model. experiment removing unnecessary sentences key sentences, result shows Classifier model’s ROUGE-1 precision is 57.86%. The was mean reciprocal rank (MRR), (MR), HIT@N rank-based evaluation metric. showed superior terms speed quality.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantically Smooth Knowledge Graph Embedding

This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...

متن کامل

Context-Dependent Knowledge Graph Embedding

We consider the problem of embedding knowledge graphs (KGs) into continuous vector spaces. Existing methods can only deal with explicit relationships within each triple, i.e., local connectivity patterns, but cannot handle implicit relationships across different triples, i.e., contextual connectivity patterns. This paper proposes context-dependent KG embedding, a twostage scheme that takes into...

متن کامل

GAKE: Graph Aware Knowledge Embedding

Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware know...

متن کامل

Graph Embedding Using Constant Shift Embedding

In the literature, although structural representations (e.g. graph) are more powerful than feature vectors in terms of representational abilities, many robust and efficient methods for classification (unsupervised and supervised) have been developed for feature vector representations. In this paper, we propose a graph embedding technique based on the constant shift embedding which transforms a ...

متن کامل

Knowledge Graph Embedding by Translating on Hyperplanes

We deal with embedding a large scale knowledge graph composed of entities and relations into a continuous vector space. TransE is a promising method proposed recently, which is very efficient while achieving state-of-the-art predictive performance. We discuss some mapping properties of relations which should be considered in embedding, such as reflexive, one-to-many, many-to-one, and many-to-ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sustainability

سال: 2022

ISSN: ['2071-1050']

DOI: https://doi.org/10.3390/su141912299